Group Sparse Recovery via the $\ell ^0(\ell ^2)$ Penalty: Theory and Algorithm
نویسندگان
چکیده
منابع مشابه
Group Sparse Recovery via the ℓ0(ℓ2) Penalty: Theory and Algorithm
In this work we propose and analyze a novel approach for recovering group sparse signals, which arise naturally in a number of practical applications. It is based on regularized least squares with an `(`) penalty. One distinct feature of the new approach is that it has the built-in decorrelation mechanism within each group, and thus can handle the challenging strong inner-group correlation. We ...
متن کاملSparse Recovery using Smoothed $\ell^0$ (SL0): Convergence Analysis
Finding the sparse solution of an underdetermined system of linear equations has many applications, especially, it is used in Compressed Sensing (CS), Sparse Component Analysis (SCA), and sparse decomposition of signals on overcomplete dictionaries. We have recently proposed a fast algorithm, called Smoothed l (SL0), for this task. Contrary to many other sparse recovery algorithms, SL0 is not b...
متن کاملSparse Recovery via Partial Regularization: Models, Theory and Algorithms
In the context of sparse recovery, it is known that most of existing regularizers such as `1 suffer from some bias incurred by some leading entries (in magnitude) of the associated vector. To neutralize this bias, we propose a class of models with partial regularizers for recovering a sparse solution of a linear system. We show that every local minimizer of these models is sufficiently sparse o...
متن کاملOptimally sparse representation in general ( nonorthogonal ) dictionaries via ell 1
www.pnas.org/cgi/content/full/100/5/2197#otherarticles This article has been cited by other articles: E-mail Alerts . click here at the top right corner of the article or Receive free email alerts when new articles cite this article sign up in the box Rights & Permissions www.pnas.org/misc/rightperm.shtml To reproduce this article in part (figures, tables) or in entirety, see: Reprints www.pnas...
متن کاملSparse Approximation via Penalty Decomposition Methods
In this paper we consider sparse approximation problems, that is, general l0 minimization problems with the l0-“norm” of a vector being a part of constraints or objective function. In particular, we first study the first-order optimality conditions for these problems. We then propose penalty decomposition (PD) methods for solving them in which a sequence of penalty subproblems are solved by a b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2017
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2016.2630028